Solving Optimization Problem under Stochastic Max-Min Separable Linear Constraints
نویسندگان
چکیده
منابع مشابه
Optimization Problems Under One-sided (max,min)-Linear Equality Constraints
In this article we will consider optimization problems, the objective function of which is equal to the maximum of a finite number of continuous functions of one variable. The set of feasible solutions is described by the system of (max,min)-linear equality constraints with variables on one side. Complexity of the proposed method with monotone or unimodal functions will be studied, possible gen...
متن کاملA Min-Max Algorithm for Solving the Linear Complementarity Problem
Abstract The Linear Complementarity Problem ) , ( q M LCP is to find a vector x in n IR satisfying 0 x , 0 q Mx and x T (Mx+q)=0, where M as a matrix and q as a vector, are given data. In this paper we show that the linear complementarity problem is completely equivalent to finding the fixed point of the map x = max (0, (I-M)x-q); to find an approximation solution to the second problem, w...
متن کاملSolving Min-Max Vehicle Routing Problem
The present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, hybrid genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; apply improved insertion method so as to improve the feasibility of the solution; retain the best selection so as to guard the diversity of...
متن کاملSolution of Some Max–Separable Optimization Problems with Inequality Constraints
Let R be the set of real numbers, ⊕ is the maximum operation so that α⊕ β = max{α, β} for any α, β ∈ R. We assume further that Rn ≡ R× . . .×R (n-times, the Cartesian product). We shall solve optimization problems consisting in the minimization of function F (f(x), g(y)), where F : R2 → R1 is an isotone function and function f(x), f : Rn → R1 is defined as follows f(x) = f(x1, . . . , xn) = f1(...
متن کاملSolving Min-Max Multi-Depot Vehicle Routing Problem∗
The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of the Single-Depot Vehicle Routing Problem (SDVRP) in which vehicle(s) start from multiple depots and return to their depots of origin at the end of their assigned tours. The traditional objective in MDVRP is to minimize the sum of all tour lengths, and existing literature handles this problem with a variety of assumptions and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Science and Mobile Computing
سال: 2021
ISSN: 2320-088X
DOI: 10.47760/ijcsmc.2021.v10i04.012